The Black-and-White Coloring Problem on Trees
نویسندگان
چکیده
منابع مشابه
The Black-and-White Coloring Problem on Trees
Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. We suggest an improved algorithm for solving this problem on trees. Submitted: June 2008 Reviewed: February 2009 Revised: March 2009 Accepted: Marc...
متن کاملThe black-and-white coloring problem on permutation graphs
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B| = b and |W| = w such that no vertex in B is adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to permutation graphs.
متن کاملThe Black-and-White Coloring Problem on Chordal Graphs
Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. This problem is known to be NPcomplete in general. We provide here a polynomial time algorithm for chordal graphs. Submitted: September 2009 Review...
متن کاملBalanced Black and White Coloring Problem on knights chessboards
Graph anticoloring problem is partial coloring problem where the main feature is the opposite rule of the graph coloring problem, i.e., if two vertices are adjacent, their assigned colors must be the same or at least one of them is uncolored. In the same way, Berge in 1972 proposed the problem of placing b black queens and w white queens on a n× n chessboard such that no two queens of different...
متن کاملThe permutation-path coloring problem on trees
In this paper we rst show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and for circular permutations which are permutations that contain exactly one cycle on trees with maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2009
ISSN: 1526-1719
DOI: 10.7155/jgaa.00180